An Anytime Look at Task Planning

نویسندگان

  • Philippe Morignot
  • François Charpillet
چکیده

In this paper, we present an analysis aiming at making task planning interruptible. A task planner represents a testbed for implementing interruption strategies. A control search in the space of partial has the property of representing one partial plan at a time only while being complete when not interrupted. A deenition of the quality of a partial plan is proposed, in addition to the statistical notion of quality as probablity of success before a deadline. Experiments and a client application are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anytime Planning For Agent Behaviour

For an agent to act successfully in a complex and dynamic environment (such as a computer game) it must have a method of generating future behaviour that meets the demands of its environment. One such method is anytime planning. This paper discusses the problems and benefits associated with making a planning system work under the anytime paradigm, and introduces AnytimeUMCP (A-UMCP), an anytime...

متن کامل

An Anytime Planning Agent For Computer Game Worlds

Computer game worlds are dynamic and operate in realtime. Any agent in such a world must utilize techniques that can deal with these environmental factors. Additionally, to advance past the current state-of-the-art, computer game agents must display intelligent goalorientated behaviour. Traditional planners, whilst ful lling the need to generate intelligent, goal-orientated behaviour, fail dram...

متن کامل

Integrating Reactive and Deliberative Planning for Agents

Autonomous agents that respond intelligently in dynamic, complex environments need to be both reactive and deliberative. Reactive systems have traditionally fared better than deliberative planers in such environments, but are often hard to code and innexible. To ll in some of these gaps, we propose a hybrid system that exploits the strengths of both reactive and deliberative systems. We demonst...

متن کامل

Planning by Rewriting

Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes the task even more difficult. This article introduces Planning by Rewriting (PbR), a new paradigm for efficient high-quality domain-independent planning. PbR exploits declarative plan-rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly suboptimal, ...

متن کامل

Transportation Scheduling and Simulation in a Railroad Scenario: A Multi-Agent Approach

This paper presents a multi-agent system for planning, plan optimization and plan executionmonitoring in a real-time railroad transportation scenario. The planning process is implemented as incremental anytime algorithm that is capable of integrating new task specifications in the ongoing planning and planexecutionprocess. An initial solution is obtained by executing thecontractnet protocol for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996